Counting points on elliptic curves over finite fields
ثبت نشده
چکیده
-We describe three algorithms to count the number of points on an elliptic curve over a finite field. The first one is very practical when the finite field is not too large; it is based on Shanks’s baby-step-giant-step strategy. The second algorithm is very efficient when the endomorphism ring of the curve is known. It exploits the natural lattice structure of this ring. The third algorithm is based on calculations with the torsion points of the elliptic curve [18]. This deterministic polynomial time algorithm was impractical in its original form. We discuss several practical improvements by Atkin and Elkies.
منابع مشابه
The Geometry of Elliptic Curves over Finite Fields
We first provide an overview of the basic results in the geometry of elliptic curves, introducing the Picard Group, Weierstrass Equations, and Isogenies. This is followed by a discussion of the structure of m-torsion points on an elliptic curve, introducing such tools as the Weil pairing and the l-adic Tate module. The paper culminates in a theorem counting the rational points on an elliptic cu...
متن کاملCounting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance
Cryptographic schemes using elliptic curves over finite fields require the computation of the cardinality of the curves. Dramatic progress have been achieved recently in that field. The aim of this article is to highlight part of these improvements and to describe an efficient implementation of them in the particular case of the field GF (2n), for n ≤ 500.
متن کاملCounting the number of points on elliptic curves over finite fields of characteristic greater than three
We present a variant of an algorithm of Oliver Atkin for counting the number of points on an elliptic curve over a nite eld. We describe an implementation of this algorithm for prime elds. We report on the use of this implementation to count the number of points on a curve over IFp, where p is a 375-digit prime.
متن کاملElliptic curves with a given number of points over finite fields
Given an elliptic curve E and a positive integer N , we consider the problem of counting the number of primes p for which the reduction of E modulo p possesses exactly N points over Fp. On average (over a family of elliptic curves), we show bounds that are significantly better than what is trivially obtained by the Hasse bound. Under some additional hypotheses, including a conjecture concerning...
متن کاملApplications of elliptic curves in public key cryptography
The most popular public key cryptosystems are based on the problem of factorization of large integers and discrete logarithm problem in finite groups, in particular in the multiplicative group of finite field and the group of points on elliptic curve over finite field. Elliptic curves are of special interest since they at present alow much shorter keys, for the same level of security, compared ...
متن کاملSatoh ' S Algorithm in Characteristic 2 Berit
We give an algorithm for counting points on arbitrary ordinary elliptic curves over finite fields of characteristic 2, extending the O(log q) method given by Takakazu Satoh, giving the asymptotically fastest point counting algorithm known to date.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017